Explicit solution to the N-body Calogero problem
نویسندگان
چکیده
منابع مشابه
/ 92 06 04 9 v 1 1 1 Ju n 19 92 Explicit Solution to the N - body Calogero problem USITP - 92 - 5 May 1992
We solve the N-body Calogero problem, i.e. N particles in 1 dimension subject to a two-body interaction of the form 1 2 ∑ i,j[(xi − xj) + g/(xi − xj)], by constructing annihilation and creation operators of the form ai = 1 √ 2 (xi±ip̂i), where p̂i is a modified momentum operator obeying Heisenberg-type commutation relations with xi, involving explicitly permutation operators. On the other hand, D...
متن کاملHidden algebra of the N-body Calogero problem
A certain generalization of the algebra gl(N,R) of first-order differential operators acting on a space of inhomogeneous polynomials in R is constructed. The generators of this (non)Lie algebra depend on permutation operators. It is shown that the Hamiltonian of the N -body Calogero model can be represented as a second-order polynomial in the generators of this algebra. Given representation imp...
متن کاملA Complete Explicit Solution to the Log-Optimal Portfolio Problem
Kramkov and Schachermayer (1999) proved the existence of log-optimal portfolios under weak assumptions in a very general setting. For many – but not all – cases, Goll and Kallsen (2000) obtained the optimal solution explicitly in terms of the semimartingale characteristics of the price process. By extending this result, this paper provides a complete explicit characterization of log-optimal por...
متن کاملAn explicit solution to the multi-level programming problem
The multi-level programming problem is defined as an n-person nonzero-sum game with perfect information in which the players move sequentially. The bi-level linear case is addressed in detail. Solutions are obtained by recasting this problem as a standard mathematical probram and appealing to its implicitly separable structure. The reformulated optimization problem is linear save for a ~ompleme...
متن کاملAn Explicit Solution to Post's Problem over the Reals
In the BSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the real Halting Language. This solution to Post’s Problem over the reals significantly differs from its classical, discrete variant where advanced diagonalization techniques are only known to yield the existence of such i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 1992
ISSN: 0370-2693
DOI: 10.1016/0370-2693(92)90166-2